Article 4317
Title of the article |
ON TREE REPRESENTATION OF READ-ONCE FUNCTIONS IN EXTENDED ELEMENTARY BASES |
Authors |
Kaftan Dar'ya Vladimirovna, Engineer, faculty of calculus mathematics and cybernetics, Lomonosov Moscow State University (1/52 Leninskie gory street, Moscow, Russia), blond.programmist@gmail.com |
Index UDK |
517.718.7 |
DOI |
10.21685/2072-3040-2017-3-4 |
Abstract |
Background. The mathematics of Booleand functions has a profound effect in the area of information technologies. This article is devoted to an important ability of the function to be represented in the given basis via a formula without replication of variables (a read-once formula). Functions which can be represented such way may be regarded as quite simply structured in this basis. We consider a problem ofread-once functions’ tree representation in the bases consisting of conjunction, disjunction, negation and polarized Stecenko’s functions. The object of the article is to provide a tree representation where equal functions have isomorphic trees and obtaina set of relevant equivalent tree transformations. |
Key words |
read-once function, canonical tree |
![]() |
Download PDF |
References |
1. Stetsenko V. A. Matematicheskie voprosy kibernetiki [Mathematical problems of cybernetics]. 1992, iss. 4, pp. 139–177. |
Дата обновления: 29.01.2018 14:57